Using the Hamiltonian path operator to capture NP
نویسندگان
چکیده
منابع مشابه
Hamiltonian index is NP-complete
In this paper we show that the problem to decide whether the hamiltonian index of a given graph is less or equal to a given constant is Research supported by grants No. 1M0545 and MSM 4977751301 of the Czech Ministry of Education. Supported by Nature Science Funds of China under Contract Grant No.: 10671014
متن کاملDilatation operator or Hamiltonian?
We analyze the situation when the Hamiltonian in field theory can be replaced by the dilatation operator.
متن کاملDOUBLY RADIATIVE np CAPTURE ? Ronald
We have calculated the cross section for n+p --c d +2y. This process depends critically on the same matrix element that gives the amplitude for singly radiative np capture from the continuum 3 S state. It has been suggested that 1’anomalous17 transitions from this continuum 3S state may explain a long-standing discrepancy in np capture ((T =334.2*.5 mb and 0 exp th = 309.5 % 5 mb) by contributi...
متن کاملFinding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...
متن کاملNP-Completeness of Hamiltonian Cycle Problem on Rooted Directed Path Graphs
The Hamiltonian cycle problem is to decide whether a given graph has a Hamiltonian cycle. Bertossi and Bonuccelli (1986, Information Processing Letters, 23, 195200) proved that the Hamiltonian Cycle Problem is NP-Complete even for undirected path graphs and left the Hamiltonian cycle problem open for directed path graphs. Narasimhan (1989, Information Processing Letters, 32, 167-170) proved tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1992
ISSN: 0022-0000
DOI: 10.1016/0022-0000(92)90043-i